Host–Guest Chemistry of a Bis‐Calix[4]pyrrole Derivative Containing a trans/cis‐Switchable Azobenzene Unit with Several Aliphatic Bis‐Carboxylates

The azobenzene unit used as a photochemically and thermally switchable linker in the assembly of a bis‐calix[4]pyrrole receptor provides a means to modulate the binding of bis‐carboxylates of significant biological importance in cancer research. Conversely, the complexation of different bis‐anionic guests has significant kinetic effects on both the photochemical and thermal trans/cis isomerization of the azobenzene unit.     

Infinite family of transmission irregular trees of even order

Distance between two vertices is the number of edges in a shortest path connecting them in a connected graph $G$. The transmission of a vertex $v$ is the sum of distances from $v$ to all the other vertices of $G$. If transmissions of all vertices are mutually distinct, then $G$ is a transmission irregular graph. It is known that almost no graphs are transmission irregular. Infinite families of transmission irregular trees of odd order were presented in Alizadeh and Klav?ar (2018). The following problem was posed in Alizadeh and Klav?ar (2018): do there exist infinite families of transmission irregular trees of even order? In this article, such a family is constructed.     

Gallai’s path decomposition conjecture for graphs of small maximum degree

Gallai’s path decomposition conjecture states that the edges of any connected graph on $n$ vertices can be decomposed into at most $\frac{n+1}{2}$ paths. We confirm that conjecture for all graphs with maximum degree at most five.     

A note on Hadwiger’s conjecture for W5-free graphs with independence number two

The Hadwiger number of a graph $G$, denoted $h\left(G\right)$, is the largest integer $t$ such that $G$ contains $K_t$ as a minor. A famous conjecture due to Hadwiger in 1943 states that for every graph $G$, $h\left(G\right)\ge \chi \left(G\right)$, where $\chi \left(G\right)$ denotes the chromatic number of $G$. Let $\alpha \left(G\right)$ denote the independence number of $G$. A graph is $H$-free if it does not contain the graph $H$ as an induced subgraph. In 2003, Plummer, Stiebitz and Toft proved that $h\left(G\right)\ge \chi \left(G\right)$ for all $H$-free graphs $G$ with $\alpha \left(G\right)\le 2$, where $H$ is any graph on four vertices with $\alpha \left(H\right)\le 2$, $H=C_5$, or $H$ is a particular graph on seven vertices. In 2010, Kriesell subsequently generalized the statement to include all forbidden subgraphs $H$ on five vertices with $\alpha \left(H\right)\le 2$. In this note, we prove that $h\left(G\right)\ge \chi \left(G\right)$ for all $W_5$-free graphs $G$ with $\alpha \left(G\right)\le 2$, where $W_5$ denotes the wheel on six vertices.     

Molecular dynamics of the intramolecular 1, 3-dipolar ene reaction of a nitrile oxide and an alkene: non-statistical behavior of a reaction involving a diradical intermediate*

ABSTRACT

Potential energy surfaces and molecular dynamics of the intramolecular 1, 3-dipolar cycloaddition and ene reaction of a nitrile oxide with an alkene were performed in the gas phase and in dichloromethane with density functional theory. One hundred trajectories were propagated in the gas phase and in dichloromethane, respectively. Twenty percent of the trajectories in the gas phase involve bicyclic intermediate and the mean time gap is 472fs. A dynamically stepwise reaction is observed. In dichloromethane, more reactive trajectories were obtained and the time gap is larger than that in the gas phase.     

The maximum multiplicity of the largest k-th eigenvalue in a matrix whose graph is acyclic or unicyclic

Given a graph $G$ we are interested in studying the symmetric matrices associated to $G$ with a fixed number of negative eigenvalues. For this class of matrices we focus on the maximum possible nullity. For trees this parameter has already been studied and plenty of applications are known. In this work we derive a formula for the maximum nullity and completely describe its behavior as a function of the number of negative eigenvalues. In addition, we also carefully describe the matrices associated with trees that attain this maximum nullity. The analysis is then extended to the more general class of unicyclic graphs. Further our work is applied to re-describing all possible partial inertias associated with trees, and is employed to study an instance of the inverse eigenvalue problem for certain trees.